Exact transient expectations for queueing networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transient Behaviour of Queueing Networks

In most contemporary queueing network analysis, the assumption is made that a network is in a state of equilibrium. That is, the network's state space probabilities are assumed to be time independent. It is therefore important to be able to quantify precisely when this assumption is valid. Furthermore there are also situations in which it is desirable to model the transient behaviour of network...

متن کامل

Transient Behavior of Queueing Networks

We present algorithms for approximating time-varying performance parameters for a Gt/G/c queuing system and for networks of such stations. The key ingredient is a formula for computing approximate sojourn time distributions for a Gt/G/c queuing system with time-varying arrivals and phase-type service times. The formula is based on transient Little laws expressing expected queue lengths and outp...

متن کامل

Clones: CLOsed queueing Networks Exact Sampling

We present Clones, a Matlab toolbox for exact sampling from the stationary distribution of a closed queueing network with finite capacities. This toolbox is based on recent results using a compact representation of sets of states that enables exact sampling from the stationary distribution without considering all initial conditions in the coupling from the past (CFTP) scheme. This representatio...

متن کامل

Transient product from distributions in queueing networks

In this paper it is shown that a necessary and sufficiënt condition for a Marko-vian queueing network to have transient product form is that all queues are infmite server queues.

متن کامل

Some Exact Results on Closed Queueing Networks with Blocking

We obtain equivalencies between closed queueing networks with blocking with respect to buffer capacities and the number of customers in the network. These results can be used in approximations, in the buffer allocation problem as well as to explain the behavior of closed queueing networks with finite buffers. We also present exact efficient solutions for special cases.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: RAIRO - Operations Research

سال: 1993

ISSN: 0399-0559,1290-3868

DOI: 10.1051/ro/1993270403891